Physical versus Computational Complementarity
نویسندگان
چکیده
The dichotomy between endophysical/intrinsic and exophysical/extrinsic perception concerns the question of how a model—mathematical, logical, computational—universe is perceived from inside or from outside, [71, 65, 66, 59, 60, 68, 67]. This distinction goes back in time at least to Archimedes, reported to have asked for a point outside the world from which one could move the earth. An exophysical perception is realized when the system is laid out and the experimenter peeps at the relevant features without changing the system. The information flows on a one-way road: from the system to the experimenter. An endophysical perception can be realized when the experimenter is part of the system under observation. In such a case one has a two-way informational flow; measurements and entities measured are interchangeable and any attempt to distinguish between them ends up as a convention. The general conception dominating the sciences is that the physical universe is perceivable only from inside. This view reduces the exophysical perception to a theoretical illusion. The more plausible perception, i.e. an endophysical one, suffers from a “self-referential” disease as any intrinsic measurement causes uncontrolled, and maybe uncontrollable, “disturbances” to the entity intended to be measured. This paper, the first in a proposed series, discusses some limitations and trade-offs between endophysical/intrinsic and exophysical/extrinsic perceptions, in both physical and computational contexts. We are building our work on Moore “gedanken” experiments [50] in which the universe is modeled by a finite deterministic automaton. A new type of computational complementarity, which mimics the state of quantum entanglement, is introduced and contrasted with Moore’s computational complementarity. Computer simulations of both types of computational complementarity are developed for four-states Moore automata.
منابع مشابه
Computational Complementarity and Shift Spaces
Computational complementarity was introduced to mimic the physical complementarity in terms of nite automata (with outputs but no initial state). Most of the work has been focussed on \frames", i.e., on xed, static, local descriptions of the system behaviour. The rst paper aiming to study the asymptotical description of complementarity was restricted to certain types of so c shifts. In this pap...
متن کاملOn Total Functions, Existence Theorems and Computational Complexity
Megiddo, N. and C.H. Papadimitriou, On total functions, existence theorems and computational complexity (Note), Theoretical Computer Science 81 (1991) 317-324. wondeterministic multivalued functions with values that are polynomially verifiable and guaranteed to exist form an interesting complexity class between P and NP. We show that this class, which we call TFNP, contains a host of important ...
متن کاملComputational Complementarity and Sofic Shifts
Finite automata (with outputs but no initial states) have been extensively used as models of computational complementarity, a property which mimics the physical complementarity. All this work was focussed on \frames", i.e., on xed, static, local descriptions of the system behaviour. In this paper we are mainly interested in the asymptotical description of complementarity. To this aim we will st...
متن کاملComplementarity for Probabilistic Automata
Motivated by Mermin’s analysis of Einstein-Podolsky-Rosen correlations [25] and [6] we study two computational complementarity principles introduced in [7] for a class of probabilistic automata. We prove the existence of probabilistic automata featuring both types of computational complementarity and we present a method to reduce, under certain conditions, the study of computational complementa...
متن کاملSolution of Nonlinear Obstacle Problems by Complementarity Algorithms
We discuss a nonlinear beam obstacle model defined by inequality constraints and differential equations with highly nonlinear and fourth order operators. An appropriate discrete approximation by the finite element method leads to a large finite-dimensional mixed nonlinear complementarity problem. We propose an interior-point algorithm for the solution of this complementarity problem. Some compu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996